Logo-enabled interactive map integrating social networking applications

ABSTRACT

A logo-enabled interactive map integrating social networking applications is provided. The interactive map may be configured to help end users discover and share information (e.g., events, deals, news occurrences, etc.) associated with a plurality of venues.

CROSS-REFERENCE TO RELATED APPLICATION

The present application claims priority to U.S. Provisional PatentApplication No. 61/654,195, filed Jun. 1, 2012, the disclosure of whichis incorporated herein in its entirety.

TECHNICAL FIELD

Embodiments of the invention relate generally to geographical mappingapplications and, more specifically, to a logo-enabled interactive mapintegrating social networking applications.

BACKGROUND

Mapping applications are used for navigational purposes to aid end usersin getting from one geographic point of interest to another.Unfortunately, traditional mapping applications present cluttered viewsof building outlines and often integrate elements that are notparticularly useful to end users. Additionally, traditional mappingapplications are typically limited to only providing information inresponse to specific geographic requests received from an end user.

There is a desire to improve traditional mapping applications so thatthey provide information not only about geographical points of interestdesired by an end user, but also to integrate non-geographicalinformation based on various activity and interests associated with theend user.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is illustrated by way of example, and not by wayof limitation, and will become apparent upon consideration of thefollowing detailed description, taken in conjunction with theaccompanying drawings, in which like reference characters refer to likeparts throughout, and in which:

FIG. 1 is a block diagram illustrating an exemplary computer network inwhich embodiments of the present invention may operate.

FIG. 2 is a block diagram illustrating exemplary components of a mapmanagement platform illustrated in FIG. 1.

FIG. 3A is a flow diagram illustrating an embodiment of a method forconducting a search for venues, wherein FIGS. 3B-3D are screen shotsillustrating various options, visual elements and search optionsintegrated in the interactive map.

FIGS. 4A and 4B are flow diagrams illustrating embodiments of methods,respectively, for handling receipt of data and verifying the datareceived to be published on the interactive map.

FIGS. 5A and 5B are flow diagrams illustrating embodiments of methods,respectively, for enabling a trip planning tool and providing anoptimized path of travel associated with the use of the trip planningtool, wherein FIG. 5C is a screen shot illustrating various visualelements associated with the aforementioned methods.

FIGS. 6A and 6B are flow diagrams illustrating embodiments of methods,respectively, for determining venue representations and determiningtheir corresponding display on the interactive map, wherein FIGS. 6C and6D are screen shots illustrating zoom levels incorporating venuepriorities associated with the aforementioned methods.

FIG. 7A is a flow diagram illustrating an embodiment of a method forenabling a friend tracking tool, wherein FIG. 7B is a screen shotillustrating various visual elements associated with the aforementionedmethod.

FIG. 8 is a flow diagram illustrating an embodiment of a method forcorrelating non-geographic communications on the interactive map.

FIG. 9 illustrates a diagrammatic representation of a machine in theexemplary form of a computer system.

DETAILED DESCRIPTION

In the following description, numerous details are set forth. It will beapparent, however, to one skilled in the art, that the present inventionmay be practiced without these specific details. In some instances,well-known structures and devices are shown in block diagram form,rather than in detail, in order to avoid obscuring the presentinvention.

Some portions of the detailed descriptions are presented in terms ofalgorithms and symbolic representations of operations on data bitswithin a computer memory. These algorithmic descriptions andrepresentations are the means used by those skilled in the dataprocessing arts to most effectively convey the substance of their workto others skilled in the art. An algorithm is here, and generally,conceived to be a self-consistent sequence of steps leading to a desiredresult. The steps are those requiring physical manipulations of physicalquantities. Usually, though not necessarily, these quantities take theform of electrical or magnetic signals capable of being stored,transferred, combined, compared, and otherwise manipulated. It hasproven convenient at times, principally for reasons of common usage, torefer to these signals as bits, values, elements, symbols, characters,terms, numbers, or the like.

It should be borne in mind, however, that all of these and similar termsare to be associated with the appropriate physical quantities and aremerely convenient labels applied to these quantities. Unlessspecifically stated otherwise, as apparent from the above discussion, itis appreciated that throughout the description, discussions utilizingterms such as “receiving”, “determining”, “identifying”, “verifying”,“generating”, “transmitting”, “processing”, “selecting”, “populating”,“displaying”, or the like, refer to the action and processes of acomputer system, or similar electronic computing device, thatmanipulates and transforms data represented as physical (electronic)quantities within the computer system's registers and memories intoother data similarly represented as physical quantities within thecomputer system memories or registers or other such information storage,transmission or display devices.

The present invention also relates to an apparatus for performing theoperations herein. This apparatus may be specially constructed for therequired purposes or it may comprise a general purpose computerselectively activated or reconfigured by a computer program stored inthe computer. Such a computer program may be stored in a computerreadable storage medium, such as, but not limited to, any type of diskincluding floppy disks, optical disks, CD-ROMs and magnetic-opticaldisks, read-only memories (ROMs), random access memories (RAMs), EPROMs,EEPROMs, magnetic or optical cards, flash memory devices includinguniversal serial bus (USB) storage devices (e.g., USB key devices) orany type of media suitable for storing electronic instructions, each ofwhich may be coupled to a computer system bus.

The algorithms and displays presented herein are not inherently relatedto any particular computer or other apparatus. Various general purposesystems may be used with programs in accordance with the teachingsherein or it may prove convenient to construct more specializedapparatus to perform the required method steps. The required structurefor a variety of these systems will be apparent from the descriptionabove. In addition, the present invention is not described withreference to any particular programming language. It will be appreciatedthat a variety of programming languages may be used to implement theteachings of the invention as described herein.

The present invention may be provided as a computer program product, orsoftware, that may include a machine-readable medium having storedthereon instructions, which may be used to program a computer system (orother electronic devices) to perform a process according to the presentinvention. A machine-readable medium includes any mechanism for storingor transmitting information in a form readable by a machine (e.g., acomputer). For example, a machine-readable (e.g., computer-readable)medium includes a machine (e.g., a computer) readable storage medium(e.g., read only memory (“ROM”), random access memory (“RAM”), magneticdisk storage media, optical storage media, flash memory devices, etc.),a machine (e.g., computer) readable transmission medium (non-propagatingelectrical, optical, or acoustical signals), etc.

FIG. 1 is a block diagram illustrating an exemplary computer network 100in which embodiments of the present invention may operate. Referring toFIG. 1, computer network 100 may be comprised of at least one mapmanagement platform 110, a plurality of computing devices 122A-122Nassociated with external data sources 120 and a plurality of computingdevices 132A-132N associated with end users 130. Computing devicesassociated with external data sources 120 and end users 130 may becommunicatively coupled, via a network 140, to one or more computerprocessing and storage accessible components of map management platform110. Network 140 may be a private network (e.g., a local area network(LAN), wide area network (WAN), intranet, etc.) or a public network(e.g., the Internet).

Map management platform 110 may be comprised of one or more computingcomponents configured to handle various processes of the presentinvention, as described herein. For example, map management platform 110may be comprised of an end user module 112, a data collection module 114and a mapping logistics module 116.

In one embodiment, end user module 112 may be configured to manage allaspects of an end user's interaction with the interactive map of thepresent invention. End user module 112 may be comprised of a pluralityof components for processing instructions to execute methods associatedwith various features available to an end user on the interactive map.Referring to FIG. 2, end user module 112 may comprise, for example, anaccount manager 222, a personalization component 224, a trip routingcomponent 226 and a friend tracking component 228.

In one embodiment, data collection module 114 may be configured tomanage all aspects of data collected to be integrated in the interactivemap of the present invention. Data collection module 114 may becomprised of a plurality of components for processing instructions toexecute methods associated with collecting and integrating data into theinteractive map. Referring to FIG. 2, data collection module 114 maycomprise, for example, a data control manager 242, a data sourcecomponent 244, an ingestion component 246 and a data verificationcomponent 248.

In one embodiment, mapping logistics module 116 may be configured tomanage all aspects of geographic and non-geographic elements integratedin the interactive map of the present invention. Mapping logisticsmodule 116 may be comprised of a plurality of components for processinginstructions to execute methods associated with integrating geographicand non-geographic elements into the interactive map. Referring to FIG.2, mapping logistics module 116 may comprise, for example, a map controlmanager 262, a venue display component 264, a non-geographiccommunication component 266 and a tile rendering component 268.

Those skilled in the art will appreciate that map management platform110 may be configured with more or less modules and components toconduct the methods described herein with reference to FIGS. 3A, 4A-5B,6A, 6B, 7A and 8. As illustrated in FIGS. 3A, 4A-5B, 6A, 6B, 7A and 8,each of corresponding methods 300, 400, 450, 500, 520, 600, 620, 700 and800 may be performed by processing logic that may comprise hardware(e.g., circuitry, dedicated logic, programmable logic, microcode, etc.),software (such as instructions run on a processing device), or acombination thereof. In one embodiment, methods 300, 400, 450, 500, 520,600, 620, 700 and 800 may be performed by one or more processingcomponents associated with modules 112, 114 and 116 of map managementplatform 110.

FIG. 3A is a flow diagram illustrating a method 300 of conducting asearch for venues using the interactive map, according to an embodimentof the invention. Referring to FIG. 3A, method 300 may be initiated uponreceiving, at block 302, an indication to conduct a search on theinteractive map. The interactive map may provide an end user with aplurality of search options including, but not limited to, a searchfield for receiving a search query, category filters for identifyingcertain venue types (e.g., bars, shopping, entertainment, etc.) ofinterest, a search based on stored venues previously identified by anend user (e.g., a venue stored as a “favorite” or any other similarpersonalization attribute), and system suggested venues using arecommendation search engine. Which of the foregoing search optionsemployed may be determined, at blocks 304, 310, 314 and 318, andcorresponding actions may be taken, at blocks 306, 308, 312, 316, 320and 322, to display relevant venues on the interactive map.

A notable search feature of the interactive map is an embodimentenabling a visual active search. Upon receiving, at block 304, entry ofa search query in a search field of the interactive map, venuerepresentations (i.e., business logos, names, categorical icons, etc.)populated on the interactive map for a particular geographic locationmay be removed, at block 306, in real-time as characters of the searchquery are entered in the search field to yield, at block 308, matchingvenues. For example, an end user searching for a Starbucks venue in adefined geographic location will begin to enter the correspondingcharacters in the name “Starbucks”, resulting in non-matching venuerepresentations being removed from the interactive map as additionalcharacters are entered in the search field.

In one embodiment, venues not matching characters of a search queryentered in the search field may still be displayed on the interactivemap. For example, an end user searching for “Joe's Coffee Shop” may seevenue representations associated with the specific venue searched, aswell as non-matching venue representations (e.g., associated withStarbucks) if a predefined association is made between a term in thesearch query (e.g., Coffee), or the specific venue searched, and thenon-matching venue. In other words, a predefined association may beprovided allowing for venue representations associated with Starbucks tobe displayed, in addition to the desired venue being searched, whenevera search query for “Joe's Coffee Shop” or any search containing the term“coffee” is made. The predefined associations may be provided as meansfor making relevant recommendations to an end user, while still removingother non-matching venue representations (not having a predefinedassociation) from the interactive map.

Another notable search feature of the interactive map is an embodimentenabling a recommendation search engine to be engaged, at block 320, tomake venue recommendations. The end user may submit an inquiry (e.g.,identify the best Chinese restaurants in Soho) and receive arecommendation of venues, identified as venue representations on theinteractive map displaying the Soho area. The recommendation engine mayprovide visual representations of both a favorability rating of a venueand a “hotness” value associated with the venue. The favorability ratingmay be based on a score determined by applying an algorithm on aggregateratings of a number of external and internal sources. A “hotness” valuemay be generated by using trending values (e.g., frequency of recentmentions, ratings and “likes” received) culled from external sourcescombined with information from users of the interactive map. Thefavorability rating and “hotness” value may be combined using a uniquevisual representation, allowing users to immediately identify desirablevenues.

FIGS. 3B-3D are screen shots illustrating various options, visualelements and some of the search options, as described in conjunctionwith FIG. 3A, integrated in the interactive map. FIG. 3B is a screenshot 330 illustrating a basic layout of the interactive map, which mayprovide a city location identification field 332, a venue type searchfilter menu 334, and listing tabs 336 and 338 comprising, respectively,deals and tweets corresponding to the area of the interactive map beingviewed. Icons 336 b and 338 b illustrated next to venue representationson a main window 340 of the interactive map correspond, respectively, todeals and tweets listed under listing tabs 336 and 338. For example, adeal 336 a identified under listing tab 336 may be represented by a dealicon 336 b (e.g., a dollar sign symbol) adjacent to the correspondingvenue logo displayed on main window 340 of the interactive map.Similarly, a tweet identified under listing tab 338 may be representedby a tweet icon 338 b (e.g., the Twitter bird logo) adjacent to thecorresponding venue name displayed on main window 340 of the interactivemap.

FIG. 3C is a screen shot 350 illustrating a pop-up window 352 aassociated with a venue representation 352, as illustrated in FIG. 3B,selected by an end user. Window 352 a may overlay main window 340 of theinteractive map. Window 352 a may contain various information about theselected venue including, but not limited to, identifying to the enduser what the venue is, where it is, how to contact it, what hashappened at the venue recently, what is happening at the venue in thenear future, what deals or specials are available, what people aresaying about the venue, and what the venue looks like. Depending on thetype of venue selected, additional information may be displayed, such asmenus, movie showings and showtimes, movie previews, and parking rates.

FIG. 3D is a screen shot 360 illustrating the visual active searchfeature of the interactive map, as previously described in method 300.When an end user begins to type a search query in search field 362,venue representations matching characters entered in search field 362are displayed on main window 340 of the interactive map, while venuerepresentations that don't have the corresponding matching charactersentered may be removed from the display of main window 340.

FIG. 4A is a flow diagram illustrating a method 400 for handling datareceived to be published on or associated with a venue displayed on theinteractive map, according to an embodiment of the invention. Referringto FIG. 4A, method 400 may be initiated upon receiving, at block 402, anindication to update or correct data associated with venues identifiedon the interactive map. Method 400 may make a determination, at block404, whether the source of data is being received from a verified dataprovider (e.g., Yellow Pages, Foursquare, Facebook, etc.) or from an enduser. In method 400, data received from a data provider may undergo aningestion process, at blocks 406 and 408, and data received from an enduser may undergo an identification and verification process, at blocks407 and 409, prior to being published, at block 412, on the interactivemap.

The ingestion process may pull external geo-tagged data based onbusiness rules and schedules, aggregate the data in such a fashion as tomake this data relevant to map users, and correlate the data withbusiness venues maintained in a database associated with the interactivemap. Once the geo-tagged data has been correlated, it may be provided onthe interactive map using any one of a plurality of map presentationdata formats. The geo-tagged data may additionally be pulled into anindexing tool for fast retrieval based on location and keywords.

FIG. 4B is a flow diagram illustrating a method 450 for verifying datareceived to be published on the interactive map or associated with avenue displayed on the interactive map, according to an embodiment ofthe invention. Referring to FIG. 4B, method 450 may be initiated uponreceiving, at block 452, an indication to verify data for use in theinteractive map. Method 450 may make a determination, at block 454,whether to implement the verification process based on relevant inputreceived from a user community, relevant input received from a dataprovider, credibility of the end user originating the data or acombination thereof. In method 450, data to be verified based on inputreceived from a user community may undergo a process, at blocks 456, 458and 460, and data to be verified based on input received from a dataprovider or credibility of the end user originating the data may undergoa process, at blocks 457, 459 and 460, before the data is authorized, atblock 462, for use in the interactive map.

When the user community is employed for the verification process, method450 may receive, at block 456, relevant data from one or more end usersin the user community confirming validity of the data received from theoriginating end user. To advance and ensure a reliable verificationprocess, credibility scores associated with end users in the usercommunity may be identified, at block 458. Similarly, when credibilityof the end user originating the data is employed for the verificationprocess, method 450 may identify, at block 457, a credibility scoreassociated with the end user originating the data.

When a data provider is employed for the verification process, method450 may receive, at block 459, relevant data from one or more dataproviders to confirm validity of the data received from the originatingend user. Relevant data received from the data provider may be comprisedof, but is certainly not limited to, business information (e.g., addressrecords, phone records, hours of operation, etc.), posted socialactivity (e.g., a recent check-in, a Facebook “like”, recent reviews,etc.), posted financial activity or any combination thereof.

Regardless of the review type selected for the verification process ofmethod 450, a determination may be made, at block 460, whetherverification threshold values have been met. When verification thresholdvalues are met (e.g., a minimum number of end users confirming validityof data, acceptable credibility scores, etc.), then the data receivedfrom the originating user may be validated and authorized, at block 462,for use in the interactive map.

FIG. 5A is a flow diagram illustrating a method 500 for enabling a tripplanning tool on the interactive map, according to an embodiment of theinvention. Referring to FIG. 5A, method 500 may be initiated uponreceiving, at block 502, an indication to identify a path of travel tomultiple venues, which may be specified by an end user or based on asystem recommendation. In determining the path of travel to multiplevenues, pre-defined user preferences may be taken into consideration, atblock 504, prior to determining, at block 506, the optimum path oftravel and displaying, at block 508, the optimum travel path to the enduser.

Method 500 may make a determination, at block 510, whether there are anyrecommended points of interest or deals available on the suggestedoptimum path of travel and, if so, they may be incorporated, at block512, into the suggested optimum path of travel displayed to the enduser. Recommendations incorporated into the optimum path of travel maybe based on user preferences explicitly and implicitly gathered.Explicit preferences may be identified using an option panel that allowsusers to select favorite categories, tags, events, specials, and deals.Implicit preferences may be identified using information gathered frompast searches, businesses clicked on, the favorability rating and thehotness value of venues, and data gathered from social mediaconnections.

FIG. 5B is a flow diagram illustrating a method 520 for determining anoptimum path of travel, according to an embodiment of the invention.Referring to FIG. 5B, method 520 may be initiated upon receiving, atblock 522, an indication to execute a travel optimization process. Indetermining an optimum path of travel to multiple venues, one or morepossible routes may be retrieved (e.g., by external sources providingdirection routing services), at block 524, to identify the routepresenting the best path of travel to the selected venues.

In determining the optimum path of travel, additional information may betaken into consideration pertaining to the multiple venues selected. Forexample, the hours of operation for a venue may be identified, at block526, the time to reach a venue based on modes of transportation selectedand nearby parking or transit stops may be identified, at block 528, thecosts associated with parking and transit may be identified, at block530, other applicable information associated with travel to a venue or acombination thereof. Upon consideration of the various inputs, anoptimal path of travel may be generated, at block 532, for presentationto an end user.

FIG. 5C is a screen shot 540 illustrating directions for a suggestedoptimum path of travel 542, which may incorporate logos 542 a and 542 bassociated with venues, respectively, for landmark purposes and tosuggest points of interest along the travel path. In one embodiment,venues that an end user's friends have highlighted (e.g., via Facebook)may be suggested along the path of travel, along with venues that aresimilar to the venues that the end user has previously highlighted.Additionally, a listing of deals, specials and events 544 may beprovided along the suggested optimum path of travel.

FIG. 6A is a flow diagram illustrating a method 600 for determiningvenue representations and determining their corresponding display on theinteractive map, according to an embodiment of the invention. Referringto FIG. 6A, method 600 may be initiated upon receiving, at block 602, anindication to populate the interactive map with venue representations.Representation types (i.e., text, logos, category icons, etc.)associated with venues may be identified, at block 604, to be displayedon the interactive map. Method 600 may then identify, at block 606, theplacement position and orientation of venue representations on theinteractive map, taking into consideration the number of venuerepresentations to be displayed, equidistant locations between adjacentvenue representations and rotational aspects for placement of the venuerepresentations corresponding to their location on a street where theirstorefronts reside, respectively, at blocks 606 a, 606 b and 606 c.Thereafter, the interactive map may be populated, at block 608, with thevenue representations.

FIG. 6B is a flow diagram illustrating a method 620 for determiningvenue representations based on a zoom level of the interactive map,according to an embodiment of the invention. Referring to FIG. 6B,method 620 may be initiated upon detecting, at block 622, a zoom levelassociated with the interactive map displayed. Method 620 may make adetermination, at block 624, whether the number of venue representations(e.g., venue logos) to be displayed exceeds a predefined displaythreshold value for the detected zoom level. If an affirmativedetermination is made, then method 620 may be configured to identify, atblock 626, priority levels associated with the venue representations anddisplay, at block 628, venue representations with the highest prioritylevel within limitations of the display threshold value. A subsequentdetermination may be made, at block 630, to determine whether anyidentified or prevailing venue representations selected for display aresubject to collision (e.g., overlap on the interactive map). If anaffirmative determination is made, then method 620 may be configured tofurther identify, at block 632, priority levels of conflicting venuerepresentations and display, at block 634, venue representations withhigher priority levels.

To determine priority levels associated with venues, stored venuespreviously identified by an end user, the recommendation search engineor a combination thereof (previously described in conjunction withmethod 300 of FIG. 3A) may be employed by method 620. For example, therecommendation search engine may retrieve rating information associatedwith venues to assign priority levels. Rating information may be basedon popularity of a venue, as determined by independent venue ratingsources, ratings provided by an end user community or a combinationthereof. Alternatively, priority levels associated with venues may bedetermined based on sponsorships relating to the venues. Additionally,priority may be given to venues that have a high “hotness” value, aspreviously described in conjunction with method 300 of FIG. 3A.

FIG. 6C is a screen shot 640 illustrating a zoomed-in view of an area ofthe interactive map having a plurality of venue representations 642comprising a first venue logo 642 a, a second venue logo 642 b, a thirdvenue logo 642 c and a fourth venue logo 642 d displayed on a cityblock. FIG. 6D is a screen shot 660 illustrating a zoomed-out view ofthe same area of the interactive map illustrated in screen shot 640 ofFIG. 6C. As can be seen, focusing on the same city block in screen shot660, only first venue logo 642 a and second venue logo 642 b arepermitted to be displayed. The determination to display first venue logo642 a and second venue logo 642 b and to remove from display third venuelogo 642 c and fourth venue logo 642 d may be based on the prioritylevels associated with each of their corresponding venues. Which of theplurality of venue representations 642 are displayed at a particularzoom level of the interactive map may be determined, for example, bymethod 620 of FIG. 6B.

FIG. 7A is a flow diagram illustrating a method 700 for enabling afriend tracking tool on the interactive map, according to an embodimentof the invention. Referring to FIG. 7A, method 700 may be initiated uponreceiving, at block 702, an indication to identify venues associatedwith an end user's travel, which may include current or past points oftravel. Method 700 may make a determination, at block 704, whether thetravel data sought is enabled to be publicly broadcast. If the enduser's travel data is not publicly available, a notification may begenerated, at block 706, informing a requesting end user that the traveldata for the desired end user is unavailable. Otherwise, method 700 mayproceed to identify and retrieve, at blocks 708, 710, 712 and 714,various information (e.g., locations visited, communications postedrelating to locations visited, etc.), while taking into considerationlimitations set by a broadcasting end user, to be displayed, at block716, on the interactive map of the requesting end user. FIG. 7B is ascreen shot 720 illustrating elements of the friend tracking tool as itmay be displayed to the requesting end user.

FIG. 8 is a flow diagram illustrating a method 800 for correlatingnon-geographic communications on the interactive map, according to anembodiment of the invention. Referring to FIG. 8, method 800 may beinitiated upon receiving, at block 802, an indication to correlate anddisplay non-geographic communications on the interactive map. Geographicpoints where non-geographic communications are to be displayed, forexample in association with a venue, may be identified, at block 804,and logged, at block 806, into metadata associated with a correspondingmap tile comprising the venue of interest. When the corresponding maptile is loaded, at block 808, for display on the interactive map, thegeographic points may be extracted, at block 810, from the map tile inorder to display, at block 812, an icon representative of thenon-geographic communication on the loaded map tile. Method 800 may makea determination, at block 814, whether the non-geographic communicationremains relevant and, if not, it may purge, at block 816, thatcommunication from metadata correlating the same to a venue on theinteractive map.

The interactive map may be comprised of a base layer map configured toreceive elements representing geographic features and landmarks. A setof geographically placed venues, each associated with one or morecategories, may be layered on the base layer map. A rendering tool maybe made available to generate venue representations on the interactivemap, which may be broken up into one or more pre-defined quadrants knownas “map tiles”. A map tile is built comprising all venues in allcategories. Additional map tiles may also be constructed for each zoomlevel, for each category and any other applicable display criteria. Maptiles may be organized by city and location, wherein each map tile maybe given a unique ID so that one or more map tiles in a map tile set maybe easily retrieved when constructing the interactive map. Tile sets maybe stored locally (e.g. in one or more servers determined to be closestin location to an end user engaging the interactive map) or, if aparticular map tile is not available locally, it may be pulled from arepository and saved locally (“edge caching”) for future use.

It should be noted that the sequence of operations described inconjunction with methods 300, 400, 450, 500, 520, 600, 620, 700 and 800may be different from that illustrated, respectively, in correspondingFIGS. 3A, 4A-5B, 6A, 6B, 7A and 8. For example, the operations at block318 illustrated in method 300 of FIG. 3A may be executed before theoperations at blocks 304, 310 and 314.

FIG. 9 illustrates a diagrammatic representation of a machine in theexemplary form of a computer system 900 within which a set ofinstructions, for causing the machine to perform any one or more of themethodologies discussed herein, may be executed. In alternativeembodiments, the machine may be connected (e.g., networked) to othermachines in a local area network (LAN), an intranet, an extranet, or theInternet. The machine may operate in the capacity of a server or aclient machine in a client-server network environment, or as a peermachine in a peer-to-peer (or distributed) network environment. Themachine may be a personal computer (PC), a tablet PC, a set-top box(STB), a personal digital assistant (PDA), a cellular telephone, a webappliance, a server, a network router, switch or bridge, or any machinecapable of executing a set of instructions (sequential or otherwise)that specify actions to be taken by that machine. Further, while only asingle machine is illustrated, the term “machine” shall also be taken toinclude any collection of machines that individually or jointly executea set (or multiple sets) of instructions to perform any one or more ofthe methodologies discussed herein.

The exemplary computer system 900 may be comprised of a processingdevice 902, a main memory 904 (e.g., read-only memory (ROM), flashmemory, dynamic random access memory (DRAM) (such as synchronous DRAM(SDRAM) or Rambus DRAM (RDRAM), etc.), a static memory 906 (e.g., flashmemory, static random access memory (SRAM), etc.), and a data storagedevice 918, which communicate with each other via a bus 930.

Processing device 902 represents one or more general-purpose processingdevices such as a microprocessor, central processing unit, or the like.More particularly, the processing device may be complex instruction setcomputing (CISC) microprocessor, reduced instruction set computer (RISC)microprocessor, very long instruction word (VLIW) microprocessor, orprocessor implementing other instruction sets, or processorsimplementing a combination of instruction sets. Processing device 902may also be one or more special-purpose processing devices such as anapplication specific integrated circuit (ASIC), a field programmablegate array (FPGA), a digital signal processor (DSP), network processor,or the like. Processing device 902 is configured to execute processinglogic 826 for performing the operations and steps discussed herein.

Computer system 900 may further include a network interface device 908.Computer system 900 also may include a video display unit 910 (e.g., aliquid crystal display (LCD) or a cathode ray tube (CRT)), analphanumeric input device 912 (e.g., a keyboard), a cursor controldevice 914 (e.g., a mouse), and a signal generation device 916 (e.g., aspeaker).

Data storage device 918 may include a machine-readable storage medium(or more specifically a computer-readable storage medium) 928 having oneor more sets of instructions (e.g., software 922) embodying any one ormore of the methodologies of functions described herein. For example,software 922 may store instructions to manage a logo-enabled interactivemap. Software 922 may also reside, completely or at least partially,within main memory 904 and/or within processing device 902 duringexecution thereof by computer system 900; main memory 904 and processingdevice 902 also constituting machine-readable storage media. Software922 may further be transmitted or received over a network 920 vianetwork interface device 908.

Machine-readable storage medium 928 may also be used to storeinstructions for managing a logo-enabled interactive map. Whilemachine-readable storage medium 928 is shown in an exemplary embodimentto be a single medium, the term “machine-readable storage medium” shouldbe taken to include a single medium or multiple media (e.g., acentralized or distributed database, and/or associated caches andservers) that store the one or more sets of instructions. The term“machine-readable storage medium” shall also be taken to include anymedium that is capable of storing or encoding a set of instruction forexecution by the machine and that causes the machine to perform any oneor more of the methodologies of the present invention. The term“machine-readable storage medium” shall accordingly be taken to include,but not be limited to, solid-state memories, and optical and magneticmedia.

Whereas many alterations and modifications of the present invention willno doubt become apparent to a person of ordinary skill in the art afterhaving read the foregoing description, it is to be understood that anyparticular embodiment shown and described by way of illustration is inno way intended to be considered limiting. Therefore, references todetails of various embodiments are not intended to limit the scope ofthe claims, which in themselves recite only those features regarded asthe invention.

We claim:
 1. A computer-implemented method of verifying venuerepresentations on a map, said method comprising: receiving, at aprogrammed computer, an indication to verify data relating to a venuerepresentation; selecting, using said programmed computer, a review typeto be conducted for verifying validity of said data relating to saidvenue representation; determining, using said programmed computer,whether a verification threshold value is met; and authorizing, usingsaid programmed computer, an action to publish said data relating tosaid venue representation on said map when said verification thresholdvalue is met.
 2. The method of claim 1, wherein said data relating tosaid venue representation is data for an existing venue representationprovided on said map.
 3. The method of claim 1, wherein said datarelating to said venue representation is data for a new venuerepresentation not yet provided on said map.
 4. The method of claim 1,wherein said review type conducted is based on data received from a dataprovider.
 5. The method of claim 4, wherein said data received from saiddata provider is used to verify validity of said data relating to saidvenue representation originated by an end user.
 6. The method of claim4, wherein said data provider is a source of data associated with socialmedia activity.
 7. The method of claim 4, wherein said data provider isa source of data associated with business information.
 8. The method ofclaim 1, wherein said data relating to said venue representationoriginates from a data provider.
 9. The method of claim 8, furthercomprising applying business rules to associate data received from saiddata provider with a venue representation.
 10. The method of claim 1,wherein said review type conducted is based on data received from aplurality of end users defining a user community.
 11. The method ofclaim 10, wherein said data received from said user community is used toverify validity of said data relating to said venue representationoriginated by an end user.
 12. The method of claim 10, wherein acredibility score is associated with each of said plurality of end usersdefining said user community.
 13. The method of claim 12, wherein saidcredibility score associated with each of said plurality of end usersdefining said user community is used in said determination whether saidverification threshold value is met.
 14. The method of claim 1, whereinsaid review type conducted is based on credibility of an end useroriginating data related to said venue representation.
 15. The method ofclaim 14, wherein a credibility score is associated with said end useroriginating data related to said venue representation.
 16. The method ofclaim 15, wherein said credibility score associated with said end useroriginating data related to said venue representation is used in saiddetermination whether said verification threshold value is met.
 17. Acomputer system for verifying venue representations on a map, saidcomputer system comprising: a memory; and a processing devicecommunicatively coupled to said memory, said processing deviceconfigured to: receive an indication to verify data relating to a venuerepresentation; select a review type to be conducted for verifyingvalidity of said data relating to said venue representation; determinewhether a verification threshold value is met; and authorize an actionto publish said data relating to said venue representation on said mapwhen said verification threshold value is met.
 18. A non-transitorycomputer-readable storage medium programmed to include instructionsthat, when executed by a processing device, cause said processing deviceto perform a method of verifying venue representations on a map, saidmethod comprising: receiving an indication to verify data relating to avenue representation; selecting a review type to be conducted forverifying validity of said data relating to said venue representation;determining whether a verification threshold value is met; andauthorizing an action to publish said data relating to said venuerepresentation on said map when said verification threshold value ismet.